On a Pollaczek-Jacobi type orthogonal polynomials
نویسندگان
چکیده
We study a sequence of polynomials orthogonal with respect to a family weights w(x) := w(x, t) = e x(1− x) , t ≥ 0, over [−1, 1]. If t = 0, this reduces to a shifted Jacobi weight. Our ladder operator formalism and the associated compatibility conditions give an easy determination of the recurrence coefficients. For t > 0, the deformation term e−t/x induces an infinitely strong zero at x = 0. The resulting t dependence of the recurrence coefficients is expressed in terms of a set of auxiliary quantities. These are a particular Painlevé V and/or allied functions. It is shown that the logarithmic derivative of the Hankel determinant,
منابع مشابه
The Askey Scheme for Hypergeometric Orthogonal Polynomials Viewed from Asymptotic Analysis
Many limits are known for hypergeometric orthogonal polynomials that occur in the Askey scheme. We show how asymptotic representations can be derived by using the generating functions of the polynomials. For example, we discuss the asymptotic representation of the Meixner-Pollaczek, Jacobi, Meixner, and Krawtchouk polynomials in terms of Laguerre polynomials.
متن کاملApplications of the monotonicity of extremal zeros of orthogonal polynomials in interlacing and optimization problems
We investigate monotonicity properties of extremal zeros of orthogonal polynomials depending on a parameter. Using a functional analysis method we prove the monotonicity of extreme zeros of associated Jacobi, associated Gegenbauer and q-Meixner-Pollaczek polynomials. We show how these results can be applied to prove interlacing of zeros of orthogonal polynomials with shifted parameters and to d...
متن کاملGeneralization of matching extensions in graphs-combinatorial interpretation of orthogonal and q-orthogonal polynomials
In this paper, we present generalization of matching extensions in graphs and we derive combinatorial interpretation of wide classes of orthogonal and q-orthogonal polynomials. Specifically, we assign general weights to complete graphs, cycles and chains or paths defining matching extensions in these graphs. The generalized matching polynomials of these graphs have recurrences defining various ...
متن کاملCombinatorial proofs of some limit formulas involving orthogonal polynomials
The object of this paper is to prove combinatorially several (13 of them) limit formulas relating different families of hypergeometric orthogonal polynomials in Askey’s chart classifying them. We first find a combinatorial model for Hahn polynomials which, as pointed out by Foata at the ICM (1983), “contains” models for Jacobi, Meixner, Krawtchouk, Laguerre and Charlier polynomials. Seven limit...
متن کاملSpectral Theory and Special Functions
A short introduction to the use of the spectral theorem for self-adjoint operators in the theory of special functions is given. As the first example, the spectral theorem is applied to Jacobi operators, i.e. tridiagonal operators, on l(Z≥0), leading to a proof of Favard’s theorem stating that polynomials satisfying a three-term recurrence relation are orthogonal polynomials. We discuss the link...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009